Using Graph Partitioning to Accelerate Longest Path Search
نویسندگان
چکیده
This thesis presents an optimal algorithm that solves the longest path problem for undirected graphs. The algorithm makes use of graph partitioning and dynamic programming. It’s performance was evaluated in a number of benchmarks and compared to other known algorithms. The runtime of the algorithm was shown to be significantly faster on the tested graphs. Deutsche Zusammenfassung Diese Arbeit präsentiert einen optimalen Algorithmus, der das Längest Wege Problem (longest path problem) für ungerichtete Graphen löst. Der Algorithmus macht sich dabei die Partitionierung von Graphen und dynamische Programmierung zu Nutzen. Seine Laufzeit wurde anhand von mehreren Experimenten evaluiert und mit anderen bekannten Algorithmen vergleichen. Dabei stellte sich der Algorithmus auf den getesteten Graphen als wesentlich schneller heraus.
منابع مشابه
Optimal Longest Paths by Dynamic Programming
We propose an optimal algorithm for solving the longest path problem in undirected weighted graphs. By using graph partitioning and dynamic programming, we obtain an algorithm that is significantly faster than other state-of-the-art methods. This enables us to solve instances that have previously been unsolved. 1998 ACM Subject Classification G.2.2 Graph Theory
متن کاملLongest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملOn the longest path in a recursively partitionable graph
A connected graph G with order n ≥ 1 is said to be recursively arbitrarily partitionable (R-AP for short) if either it is isomorphic to K1, or for every sequence (n1, ..., np) of positive integers summing up to n there exists a partition (V1, ..., Vp) of V (G) such that each Vi induces a connected R-AP subgraph of G on ni vertices. Since previous investigations, it is believed that a R-AP graph...
متن کاملA Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs
Given a graph G, the longest path problem asks to compute a simple path of G with the largest number of vertices. This problem is the most natural optimization version of the well-known and well-studied Hamiltonian path problem, and thus it is NP-hard on general graphs. However, in contrast to the Hamiltonian path problem, there are only a few restricted graph families, such as trees, and some ...
متن کاملSolving the Longest Simple Path Problem with Constraint-Based Techniques
The longest simple path problem on graphs arises in a variety of context, e.g., information retrieval, VLSI design, robot patrolling. Given an undirected weighted graph G = (V,E) , the problem consists of finding the longest simple path (i.e., no vertex occurs more than once) onG . We propose in this paper an exact and a tabu search algorithm for solving this problem. We show that our technique...
متن کامل